منابع مشابه
Radii and centers in iterated line digraphs
We show that the out-radius and the radius grow linearly, or “almost” linearly, in iterated line digraphs. Further, iterated line digraphs with a prescribed out-center, or a center, are constructed. It is shown that not every line digraph is admissible as an out-center of line digraph.
متن کاملTransmission Fault-tolerance of Iterated Line Digraphs Transmission Fault-tolerance of Iterated Line Digraphs Transmission Fault-tolerance of Iterated Line Digraphs
Many interconnection networks can be constructed with line digraph iterations. In this paper, we will establish a general result on super line-connectivity based on the line digraph iteration which improves and generalizes several existing results in the literature.
متن کاملZero forcing in iterated line digraphs
Zero forcing is a propagation process on a graph, or digraph, defined in linear algebra to provide a bound for the minimum rank problem. Independently, zero forcing was introduced in physics, computer science and network science, areas where line digraphs are frequently used as models. Zero forcing is also related to power domination, a propagation process that models the monitoring of electric...
متن کاملIndependence number of iterated line digraphs
In this paper, we deal with the independence number of iterated line digraphs of a regular digraph G. We give pertinent lower bounds and give an asymptotic estimation of the ratio of the number of vertices of a largest independent set of the nth iterated line digraph of G. © 2005 Elsevier B.V. All rights reserved.
متن کاملSuper link-connectivity of iterated line digraphs
Many interconnection networks can be constructed with line digraph iterations. A digraph has super link-connectivity d if it has link-connectivity d and every link-cut of cardinality d consists of either all out-links coming from a node, or all in-links ending at a node, excluding loop. In this paper, we show that the link-digraph iteration preserves super link-connectivity. c © 2003 Elsevier B...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2001
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00450-7